Syntactic Analysis of Unrestricted French
نویسندگان
چکیده
This paper describes a practical parser for unrestricted relations. These relations are computed between chunks and speci ed within a unique formalism. They are represented by means of labeled and directed links. The present implementation handles dependency, coordination and antecedence relations.
منابع مشابه
From Part of Speech Tagging to Memory-based Deep Syntactic Analysis
This paper presents a robust system for deep syntactic parsing of unrestricted French. This system uses techniques from Part-of-Speech tagging in order to build a constituent structure and uses other techniques from dependency grammar in an original framework of memories in order to build a functional structure. The two structures are build simultaneously by two interacting processes. The proce...
متن کاملA Modular Architecture for Anaphora Resolution
Anaphora resolution attempts to determine the correct antecedent of an anaphor (the term pointing back). In what follows, we propose an algorithm for the resolution of anaphoric pronouns that relies on lexical and syntactic knowledge incorporated in a modular approach based on constraints and preferences. Our objective was to find the correct antecedent to the following subject pronouns (il, il...
متن کاملFrench parsing enhanced with a word clustering method based on a syntactic lexicon
This article evaluates the integration of data extracted from a French syntactic lexicon, the Lexicon-Grammar (Gross, 1994), into a probabilistic parser. We show that by applying clustering methods on verbs of the French Treebank (Abeillé et al., 2003), we obtain accurate performances on French with a parser based on a Probabilistic Context-Free Grammar (Petrov et al., 2006).
متن کاملDeep Syntax Annotation of the Sequoia French Treebank
We define a deep syntactic representation scheme for French, which abstracts away from surface syntactic variation and diathesis alternations, and describe the annotation of deep syntactic representations on top of the surface dependency trees of the Sequoia corpus. The resulting deep-annotated corpus, named DEEP-SEQUOIA, is freely available, and hopefully useful for corpus linguistics studies ...
متن کاملAn Improved Statistical Transfer System for French-English Machine Translation
This paper presents the Carnegie Mellon University statistical transfer MT system submitted to the 2009 WMT shared task in French-to-English translation. We describe a syntax-based approach that incorporates both syntactic and non-syntactic phrase pairs in addition to a syntactic grammar. After reporting development test results, we conduct a preliminary analysis of the coverage and effectivene...
متن کامل